翻訳と辞書 |
Gewirtz graph : ウィキペディア英語版 | Gewirtz graph
The Gewirtz graph is a strongly regular graph with 56 vertices and valency 10. It is named after the mathematician Allan Gewirtz, who described the graph in his dissertation.〔(Allan Gewirtz ), ''Graphs with Maximal Even Girth'', Ph.D. Dissertation in Mathematics, City University of New York, 1967.〕 ==Construction== The Gewirtz graph can be constructed as follows. Consider the unique ''S''(3, 6, 22) Steiner system, with 22 elements and 77 blocks. Choose a random element, and let the vertices be the 56 blocks not containing it. Two blocks are adjacent when they are disjoint. With this construction, one can embed the Gewirtz graph in the Higman–Sims graph.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Gewirtz graph」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|